Three Sides of Harberger Triangles

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficiency and stabilization : reducing Harberger triangles and Okun gaps

We provide in this paper a simple example of a dynamic stochastic imperfectly competitive economy in which introducing some distortive taxation increases both allocation efficiency and stabilization.  2001 Published by Elsevier Science B.V.

متن کامل

Three sides of a coin.

Any neutral observer of humanity might come to the conclusion that most adults in the developed world have a range of serious addiction problems. Young people often begin to explore the effects of alcohol, nicotine, cannabis and other drugs for social and psychological reasons, continuing their use of their preferred narcotic into adult life. In adults, the cocktail is enhanced by the use of as...

متن کامل

A Remark on Prime Divisors of Lengths of Sides of Heron Triangles

A Heron triangle is a triangle having the property that the lengths of its sides as well as its area are positive integers. Let P be a fixed set of primes, let S denote the set of integers divisible only by primes in P. We prove that there are only finitely many Heron triangles whose sides a, b, c ∈ S and are reduced, that is gcd(a, b, c) = 1. If P contains only one prime ≡ 1 (mod 4) then all t...

متن کامل

Monochromatic triangles in three-coloured graphs

In 1959, Goodman [9] determined the minimum number of monochromatic triangles in a complete graph whose edge set is 2-coloured. Goodman [10] also raised the question of proving analogous results for complete graphs whose edge sets are coloured with more than two colours. In this paper, for n sufficiently large, we determine the minimum number of monochromatic triangles in a 3-coloured copy of K...

متن کامل

Rainbow triangles in three-colored graphs

Erdős and Sós proposed a problem of determining the maximum number F (n) of rainbow triangles in 3-edge-colored complete graphs on n vertices. They conjectured that F (n) = F (a)+ F (b) +F (c) +F (d) + abc+ abd+ acd+ bcd, where a+ b+ c+ d = n and a, b, c, d are as equal as possible. We prove that the conjectured recurrence holds for sufficiently large n. We also prove the conjecture for n = 4 f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Economic Perspectives

سال: 1999

ISSN: 0895-3309

DOI: 10.1257/jep.13.2.167